A New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System

author

  • F. Moeen Moghadas Ferdowsi University of Mashhad
Abstract:

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these approaches are compared with the solutions obtained by CPLEX. Results show that using the new procedure in which sub-problems were solved with Branch and bound is better.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

a new heuristic solution method for maximal covering location-allocation problem with m/m/1 queueing system

we consider the queueing maximal covering location-allocation problem (qm-clap) with an m/m/1 queueing system. we propose a new solution procedure based on decomposition of the problem into smaller sub-problems. we solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic grasp. we also solve the entire model with grasp. computational results for these ...

full text

Maximal covering location-allocation problem with M/M/k queuing system and side constraints

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

full text

Queueing Maximal Covering Location-Allocation Problem: An Extension with M/G/1 Queueing Systems

We consider the queueing maximal covering location-allocation problem QM-CLAP with an M/G/1 queueing system. We first formulate the problem as a binary quadratic programming problem and then propose a new solution procedure based on decomposition of the problem into smaller binary quadratic sub-problems. The heuristic procedure GRASP is used to solve the subproblems, as well as the entire model...

full text

A Decomposition Heuristic for the Maximal Covering Location Problem

This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, ...

full text

A simulated annealing-based heuristic for the single allocation maximal covering hub location problem

Abstract: Hub location problem is one of the most important problems in the areas of logistics and telecommunication network design. In this paper, we address the single allocation maximal covering hub location problem in which the objective is to maximise the amount of covered flows associated with origin-destination pairs in a hub-and-spoke network using a fixed number of hub facilities. Two ...

full text

Hybrid heuristics for the probabilistic maximal covering location-allocation problem

The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering locationallocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. This pa...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 23  issue 1

pages  67- 75

publication date 2012-03-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023